An exact solution to the transistor sizing problem for CMOS circuits using convex optimization
نویسندگان
چکیده
Circuit delays in MOS integrated circuits often need to be reduced to obtain faster response times, with a minimal area penalty. A typical MOS digital integrated circuit consists of multiple stages of combinational logic blocks that lie between latches, clocked by system clock signals. Delay reduction must ensure that the worst-case delay of the combinational blocks is such that valid signals reach a latch before any transition in the signal clocking the latch, with allowances for set-up time requirements. In other words, the worst-case delay of each combinational stage must be restricted to be below a certain speci cation. The requirements for hold times are di erent in nature, and are not addressed in this paper.
منابع مشابه
CMOS op-amp sizing using a geometric programming formulation
The problem of CMOS op-amp circuit sizing is addressed here. Given a circuit and its performance specifications, the goal is to automatically determine the device sizes in order to meet the given performance specifications while minimizing a cost function, such as a weighted sum of the active area and power dissipation. The approach is based on the observation that the first order behavior of a...
متن کاملA Survey of Power Management in Embedded System Using Transistor Sizing
This paper describes a transistor sizing methodology for both analog and digital CMOS circuits. Various techniques are used for power optimization in CMOS VLSI circuits. Transistor sizing is one of the important techniques for the determination of circuit performance. The aim of the power optimization is to minimize the power and power-delay product or the energy consumption of the circuit. Thu...
متن کاملOptimal Wire and Transistor Sizing for Circuits with Non-Tree Topology1
Conventional methods for optimal sizing of wires and transistors use linear RC circuit models and the Elmore delay as a measure of signal delay. If the RC circuit has a tree topology the sizing problem reduces to a convex optimization problem which can be solved using geometric programming. The tree topology restriction precludes the use of these methods in several sizing problems of signi cant...
متن کامل\an Exact Solution to the Transistor Siz- Ing Problem for Cmos Circuits Using Convex Optimization," Ieee Trans. on Computer-aided Design of Run Time (s) Pitch-spacing Min Giss/faf Giss/vaf Lr-based Giss/vaf Lr-based 2 4.2 Wire Sizing and Spacing for Multiple Nets
\Optimal wire sizing and buuer insertion for low power and a generalized delay model," in Proc. 17 problems are solved in the context of simultaneous device and wire sizing optimization for deep submicron designs. Experiments show that our LR-based optimization algorithm is very eeective and extremely eecient. Up to 16.5% delay reduction is observed when compared with previous work based on the...
متن کاملA Transistor Sizing Tool for Optimization of Analog CMOS Circuits: TSOp
Optimization of a circuit by transistor sizing is often a slow, tedious and iterative manual process which relies on designer intuition. It is highly desirable to automate the transistor sizing process towards being able to rapidly design high performance integrated circuit. Presented here is a simple but effective algorithm for automatically optimizing the circuit parameters by exploiting the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 12 شماره
صفحات -
تاریخ انتشار 1993